A Review on Constraint Handling Techniques for Population-based Algorithms: from single-objective to multi-objective optimization
نویسندگان
چکیده
Abstract Most real-world problems involve some type of optimization that are often constrained. Numerous researchers have investigated several techniques to deal with constrained single-objective and multi-objective evolutionary in many fields, including theory application. This presented study provides a novel analysis scholarly literature on constraint-handling for population-based algorithms according the most relevant journals articles. As contribution this study, paper reviews main ideas state-of-the-art constraint handling optimization, then addresses bibliometric analysis, focus multi-objective, field. The extracted papers include research articles, reviews, book/book chapters, conference published between 2000 2021 analysis. results indicate received much less attention compared optimization. promising such were determined be genetic algorithms, differential particle swarm intelligence. Additionally, “Engineering,” “Computer Science,” “ Mathematics” identified as top three fields which future work is anticipated increase.
منابع مشابه
Review on Single & Multi-objective Optimization Techniques
In this paper a comparison between the single and multi-objective based Optimization techniques including GA, PSO and Hybrid will be presented. The hybrid technique is combined of two attractive evolutionary techniques, Particle Swarm Optimizer (PSO) and Genetic Algorithm (GA) to enhance the search process by improving the diversity, and the convergence toward the preferred solution. This is no...
متن کاملProposed Working Title: Population-based Techniques for Multi-objective Optimization
The use of population-based techniques to solve optimization problems is continuously increasing, as these kind of problems appears in a number of situations in real life. Many of these problems are of a combinatorial nature, this means that we have to find the ideal permutation of the parameters involved to reach the optimal solution. As the number of parameters increases, the difficulty to fi...
متن کاملEfficient Approximation Algorithms for Multi-objective Constraint Optimization
In this paper, we propose new depth-first heuristic search algorithms to approximate the set of Pareto optimal solutions in multi-objective constraint optimization. Our approach builds upon recent advances in multi-objective heuristic search over weighted AND/OR search spaces and uses an -dominance relation between cost vectors to significantly reduce the set of non-dominated solutions. Our emp...
متن کاملA Comprehensive Review on Multi-Objective Optimization Using Genetic Algorithms
In real world applications, most of the optimization problems involve more than one objective to be optimized. The objectives in most of engineering problems are often conflicting, i.e., maximize performance, minimize cost, maximize reliability, etc. In the case, one extreme solution would not satisfy both objective functions and the optimal solution of one objective will not necessary be the b...
متن کاملConstraint Approach to Multi-Objective Optimization
In many practical situations, we would like to maximize (or minimize) several different criteria, and it is not clear how much weight to assign to each of these criteria. Such situations are ubiquitous and thus, it is important to be able to solve the corresponding multi-objective optimization problems. There exist many heuristic methods for solving such problems. In this paper, we reformulate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Computational Methods in Engineering
سال: 2022
ISSN: ['1886-1784', '1134-3060']
DOI: https://doi.org/10.1007/s11831-022-09859-9